package com.leetcode.dynamic;

/**
 * @program: leetcode
 * @author: jzhou
 * @date: 2022-11-30 20:48
 * @version: 1.0
 * @description: 编辑距离
 **/
public class MinDistance {
    public int minDistance(String word1, String word2) {

        int m = word1.length() + 1;
        int n = word2.length() + 1;

        int[][] dp = new int[m][n];

        //初始化已知数据
        //初始化第一行
        for (int i = 0; i < n; i++) {
            dp[0][i] = i;
        }
        // 初始化第一列
        for (int i = 0; i < m; i++) {
            dp[i][0] = i;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (word1.charAt(i - 1) == word2.charAt(j -1)){
                    dp[i][j] =  dp[i-1][j-1];
                }else {
                    dp[i][j] = Math.min(dp[i-1][j-1],Math.min(dp[i][j-1],dp[i - 1][j])) + 1;
                }
            }
        }

        return dp[m - 1][n - 1];
    }
}
